A Deterministic Descartes Algorithm for Real Polynomials
نویسندگان
چکیده
We describe a Descartes algorithm for root isolation of polynomials with real coefficients. It is assumed that the coefficients of the polynomial can be approximated with arbitrary precision; exact computation in the field of coefficients is not required. We refer to such coefficients as bitstream coefficients. The algorithm is deterministic and has almost the same asymptotic complexity as the randomized bitstream-Descartes algorithm of Eigenwillig et al. (2005). Besides being deterministic, the algorithm is also somewhat simpler to analyze.
منابع مشابه
Algorithms for Complex Shapes with Certified Numerics and Topology A deterministic Bitstream Descartes Algorithm
We describe a variant of the Descartes algorithm for root isolation of polynomials with real coefficients. It is assumed that the coefficients of the polynomial can be approximated with arbitrary precision; exact computation in the field of coefficients is not required. We refer to such coefficients as bitstream coefficients. The algorithm is deterministic and has same asymptotic complexity as ...
متن کاملA Descartes Algorithm for Polynomials with Bit-Stream Coefficients
The Descartes method is an algorithm for isolating the real roots of square-free polynomials with real coefficients. We assume that coefficients are given as (potentially infinite) bit-streams. In other words, coefficients can be approximated to any desired accuracy, but are not known exactly. We show that a variant of the Descartes algorithm can cope with bit-stream coefficients. To isolate th...
متن کاملOn the Complexity of Real Root Isolation
We introduce a new method to isolate the real roots of a square-free polynomial F = ∑i=0 Aix with real coefficients Ai, where |An| ≥ 1 and |Ai| ≤ 2τ for all i. It is assumed that each coefficient of F can be approximated to any specified error bound. The presented method is exact, complete and deterministic. Due to its similarities to the Descartes method, we also consider it practical and easy...
متن کاملShallow circuits with high-powered inputs
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show that a deterministic black-box identity testing algorithm for (high-degree) univariate polynomials would imply a lower bound on the arithmetic complexity of the permanent. The lower bounds that are known to follow from...
متن کاملReal root isolation for exact and approximate polynomials using Descartes' rule of signs
Collins und Akritas (1976) have described the Descartes method for isolating the real roots of an integer polynomial in one variable. This method recursively subdivides an initial interval until Descartes’ Rule of Signs indicates that all roots have been isolated. The partial converse of Descartes’ Rule by Obreshkoff (1952) in conjunction with the bound of Mahler (1964) and Davenport (1985) lea...
متن کامل